66 research outputs found
DeepTract: A Probabilistic Deep Learning Framework for White Matter Fiber Tractography
We present DeepTract, a deep-learning framework for estimating white matter
fibers orientation and streamline tractography. We adopt a data-driven approach
for fiber reconstruction from diffusion weighted images (DWI), which does not
assume a specific diffusion model. We use a recurrent neural network for
mapping sequences of DWI values into probabilistic fiber orientation
distributions. Based on these estimations, our model facilitates both
deterministic and probabilistic streamline tractography. We quantitatively
evaluate our method using the Tractometer tool, demonstrating competitive
performance with state-of-the art classical and machine learning based
tractography algorithms. We further present qualitative results of
bundle-specific probabilistic tractography obtained using our method. The code
is publicly available at: https://github.com/itaybenou/DeepTract.git
Simple, Fast and Accurate Implementation of the Diffusion Approximation Algorithm for Stochastic Ion Channels with Multiple States
The phenomena that emerge from the interaction of the stochastic opening and
closing of ion channels (channel noise) with the non-linear neural dynamics are
essential to our understanding of the operation of the nervous system. The
effects that channel noise can have on neural dynamics are generally studied
using numerical simulations of stochastic models. Algorithms based on discrete
Markov Chains (MC) seem to be the most reliable and trustworthy, but even
optimized algorithms come with a non-negligible computational cost. Diffusion
Approximation (DA) methods use Stochastic Differential Equations (SDE) to
approximate the behavior of a number of MCs, considerably speeding up
simulation times. However, model comparisons have suggested that DA methods did
not lead to the same results as in MC modeling in terms of channel noise
statistics and effects on excitability. Recently, it was shown that the
difference arose because MCs were modeled with coupled activation subunits,
while the DA was modeled using uncoupled activation subunits. Implementations
of DA with coupled subunits, in the context of a specific kinetic scheme,
yielded similar results to MC. However, it remained unclear how to generalize
these implementations to different kinetic schemes, or whether they were faster
than MC algorithms. Additionally, a steady state approximation was used for the
stochastic terms, which, as we show here, can introduce significant
inaccuracies. We derived the SDE explicitly for any given ion channel kinetic
scheme. The resulting generic equations were surprisingly simple and
interpretable - allowing an easy and efficient DA implementation. The algorithm
was tested in a voltage clamp simulation and in two different current clamp
simulations, yielding the same results as MC modeling. Also, the simulation
efficiency of this DA method demonstrated considerable superiority over MC
methods.Comment: 32 text pages, 10 figures, 1 supplementary text + figur
Active Learning and Proofreading for Delineation of Curvilinear Structures
Many state-of-the-art delineation methods rely on supervised machine learning algorithms. As a result, they require manually annotated training data, which is tedious to obtain. Furthermore, even minor classification errors may significantly affect the topology of the final result. In this paper we propose a generic approach to addressing both of these problems by taking into account the influence of a potential misclassification on the resulting delineation. In an Active Learning context, we identify parts of linear structures that should be annotated first in order to train a classifier effectively. In a proofreading context, we similarly find regions of the resulting reconstruction that should be verified in priority to obtain a nearly-perfect result. In both cases, by focusing the attention of the human expert on potential classification mistakes which are the most critical parts of the delineation, we reduce the amount of required supervision. We demonstrate the effectiveness of our approach on microscopy images depicting blood vessels and neurons
Structures of the Signal Recognition Particle Receptor from the Archaeon Pyrococcus furiosus: Implications for the Targeting Step at the Membrane
In all organisms, a ribonucleoprotein called the signal recognition particle (SRP) and its receptor (SR) target nascent proteins from the ribosome to the translocon for secretion or membrane insertion. We present the first X-ray structures of an archeal FtsY, the receptor from the hyper-thermophile Pyrococcus furiosus (Pfu), in its free and GDPâąmagnesium-bound forms. The highly charged N-terminal domain of Pfu-FtsY is distinguished by a long N-terminal helix. The basic charges on the surface of this helix are likely to regulate interactions at the membrane. A peripheral GDP bound near a regulatory motif could indicate a site of interaction between the receptor and ribosomal or SRP RNAs. Small angle X-ray scattering and analytical ultracentrifugation indicate that the crystal structure of Pfu-FtsY correlates well with the average conformation in solution. Based on previous structures of two sub-complexes, we propose a model of the core of archeal and eukaryotic SRPâąSR targeting complexes
Why rankings of biomedical image analysis competitions should be interpreted with care (vol 9, 5217, 2018)
In the original version of this Article the values in the rightmost column of Table 1 were inadvertently shifted relative to the other columns. This has now been corrected in the PDF and HTML versions of the Article
Building connectomes using diffusion MRI: why, how and but
Why has diffusion MRI become a principal modality for mapping connectomes in vivo? How do different image acquisition parameters, fiber tracking algorithms and other methodological choices affect connectome estimation? What are the main factors that dictate the success and failure of connectome reconstruction? These are some of the key questions that we aim to address in this review. We provide an overview of the key methods that can be used to estimate the nodes and edges of macroscale connectomes, and we discuss open problems and inherent limitations. We argue that diffusion MRI-based connectome mapping methods are still in their infancy and caution against blind application of deep white matter tractography due to the challenges inherent to connectome reconstruction. We review a number of studies that provide evidence of useful microstructural and network properties that can be extracted in various independent and biologically-relevant contexts. Finally, we highlight some of the key deficiencies of current macroscale connectome mapping methodologies and motivate future developments
International Consensus Statement on Rhinology and Allergy: Rhinosinusitis
Background: The 5 years since the publication of the first International Consensus Statement on Allergy and Rhinology: Rhinosinusitis (ICARâRS) has witnessed foundational progress in our understanding and treatment of rhinologic disease. These advances are reflected within the more than 40 new topics covered within the ICARâRSâ2021 as well as updates to the original 140 topics. This executive summary consolidates the evidenceâbased findings of the document. Methods: ICARâRS presents over 180 topics in the forms of evidenceâbased reviews with recommendations (EBRRs), evidenceâbased reviews, and literature reviews. The highest grade structured recommendations of the EBRR sections are summarized in this executive summary. Results: ICARâRSâ2021 covers 22 topics regarding the medical management of RS, which are grade A/B and are presented in the executive summary. Additionally, 4 topics regarding the surgical management of RS are grade A/B and are presented in the executive summary. Finally, a comprehensive evidenceâbased management algorithm is provided. Conclusion: This ICARâRSâ2021 executive summary provides a compilation of the evidenceâbased recommendations for medical and surgical treatment of the most common forms of RS
- âŠ